Muller automaton

Results: 32



#Item
11Recognizing regular tree languages with static information Alain Frisch (ENS Paris) PLAN-X 2004 p.1/22

Recognizing regular tree languages with static information Alain Frisch (ENS Paris) PLAN-X 2004 p.1/22

Add to Reading List

Source URL: www.cduce.org

Language: English - Date: 2013-12-06 16:18:34
12PII:

PII:

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2014-03-05 16:37:08
13Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization ∗ Marcelo Arenas Departamento de Ciencia de la Computaci´on Pontificia Universidad Cat´olica de Chile

Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization ∗ Marcelo Arenas Departamento de Ciencia de la Computaci´on Pontificia Universidad Cat´olica de Chile

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2011-09-27 14:57:55
14Foundations of Software Technology and Theoretical Computer ScienceSubmission  Quasi-Weak Cost Automata: A New Variant of Weakness∗ Denis Kuperberg1 , Michael Vanden Boom2 1 L IAFA /CNRS/Universit´

Foundations of Software Technology and Theoretical Computer ScienceSubmission Quasi-Weak Cost Automata: A New Variant of Weakness∗ Denis Kuperberg1 , Michael Vanden Boom2 1 L IAFA /CNRS/Universit´

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2012-10-25 13:52:51
15Determinisation of history-deterministic automata 1 1  Denis Kuperberg , Michał Skrzypczak

Determinisation of history-deterministic automata 1 1 Denis Kuperberg , Michał Skrzypczak

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2014-07-04 07:26:19
16Two-Way Cost Automata and Cost Logics over Infinite Trees Achim Blumensath TU Darmstadt  Thomas Colcombet

Two-Way Cost Automata and Cost Logics over Infinite Trees Achim Blumensath TU Darmstadt Thomas Colcombet

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2014-01-20 11:11:33
17On the Expressive Power of Cost Logics over Infinite Words? Denis Kuperberg1 , Michael Vanden Boom2 1  2

On the Expressive Power of Cost Logics over Infinite Words? Denis Kuperberg1 , Michael Vanden Boom2 1 2

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2012-10-25 13:52:50
18Nondeterminism in the Presence of a Diverse or Unknown Future ? Udi Boker1 , Denis Kuperberg2 , Orna Kupferman2 , and Michał Skrzypczak3 1  2

Nondeterminism in the Presence of a Diverse or Unknown Future ? Udi Boker1 , Denis Kuperberg2 , Orna Kupferman2 , and Michał Skrzypczak3 1 2

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2013-04-29 05:18:08
19Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France

Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2013-08-07 05:31:08
20Unambiguous Finite Automata ¨ Christof Loding Department of Computer Science RWTH Aachen University, Germany

Unambiguous Finite Automata ¨ Christof Loding Department of Computer Science RWTH Aachen University, Germany

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2013-06-27 09:04:03